#include <bits/stdc++.h>
using namespace std;
const int MAXN=1e5+50;
int n,r[MAXN],ans;
bool vis[MAXN];
void dfs(int p,int num){
    for(int i=1;i<=n and i!=p;i++){
        if(r[i]<r[p] and !vis[p]){
            ans--;
            vis[p]=1;
            vis[i]=1;
            break;
        }
    }
}
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    ans=n;
    for(int i=1;i<=n;i++){
        cin>>r[i];
    }
    for(int i=1;i<=n;i++){
        if(!vis[i]){
            dfs(i,n);
        }
    }
    cout<<ans;
    return 0;
}
